Minimum 2-Tuple Dominating Set of an Interval Graph
نویسندگان
چکیده
منابع مشابه
Minimum 2-Tuple Dominating Set of an Interval Graph
The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes ...
متن کاملAlgorithms for minimum m-connected k-tuple dominating set problem
In wireless sensor networks, a virtual backbone has been proposed as the routing infrastructure to alleviate the broadcasting storm problem and perform some other tasks such as area monitoring. Previous work in this area has mainly focused on how to set up a small virtual backbone for high efficiency, which is modelled as the minimum Connected Dominating Set (CDS) problem. In this paper we cons...
متن کاملGraph Neural Network for Minimum Dominating Set
The dominating set concept in graphs has been used in many applications. In large graphs finding the minimum dominating set is difficult. The minimum dominating set problem in graphs seek a set D of minimum number of vertices such that each vertex of the graph is either in D or adjacent to a vertex in D. In a graph on n nodes if there is a single node of degree n-1 then that single node forms a...
متن کاملFinding a minimum independent dominating set in a permutation graph
We give an 0 (nlogln) [ime algorirnm for finding a minimum independem dominating se[ in a pennmation graph. TItis improves on ilie previous D(n 3) time algorictun known for solving tllis problem [4]. .,. Dept of CompUlcr Sci., Purdue Univ., West Gf:tyelle, IN 47907. Rcso::trch ~upported by ONR. Contr:lct NOOOI-l-34-K. 0502:md NSF Gl':tnl DCR-8451393, wilh matching funds from AT&T. • o.:pt of Ma...
متن کاملMinimum Dominating Set for a Point Set in $\IR^2$
In this article, we consider the problem of computing minimum dominating set for a given set S of n points in R. Here the objective is to find a minimum cardinality subset S of S such that the union of the unit radius disks centered at the points in S covers all the points in S. We first propose a simple 4-factor and 3-factor approximation algorithms in O(n log n) and O(n logn) time respectivel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Combinatorics
سال: 2011
ISSN: 1687-9163,1687-9171
DOI: 10.1155/2011/389369